منابع مشابه
On Degree Sequences Forcing The Square of a Hamilton Cycle
A famous conjecture of Pósa from 1962 asserts that every graph on n vertices and with minimum degree at least 2n/3 contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Komlós, Sárközy and Szemerédi [23]. In this paper we prove a degree sequence version of Pósa’s conjecture: Given any η > 0, every graph G of sufficiently large order n contains the square...
متن کاملSquare of a Hamilton cycle in a random graph
We show that the threshold for the random graph Gn,p to contain the square of a Hamilton cycle is p = 1 √ n . This improves the previous results of Kühn and Osthus and also Nenadov and Škorić.
متن کاملSquare of Hamilton cycle in a random graph
We show that p = √ e n is a sharp threshold for the random graph Gn,p to contain the square of a Hamilton cycle. This improves the previous results of Kühn and Osthus and also Nenadov and Škorić.
متن کاملAvoid hangover?
The chances of experiencing a hangover significantly increase with five or more drinks, especially when consumed in a short period of time. Research supports the theory that the major cause of a hangover is simply drinking too much. Drinking a large quantity of alcohol quickly, as is usually the case in drinking games, tends to increase the incidence of hangovers ? not to mention other negative...
متن کاملAvoid hangover?
The chances of experiencing a hangover significantly increase with five or more drinks, especially when consumed in a short period of time. Research supports the theory that the major cause of a hangover is simply drinking too much. Drinking a large quantity of alcohol quickly, as is usually the case in drinking games, tends to increase the incidence of hangovers ? not to mention other negative...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Psychiatric Treatment
سال: 2014
ISSN: 1355-5146,1472-1481
DOI: 10.1192/apt.bp.113.011858